Complete graph - PDFSEARCH.IO - Document Search Engine

Complete graph
Results: 868

#	Item
191	b-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs ∗ Flavia Bonomo1 , Oliver Schaudt2 , Maya Stein3 , and Mario Valencia-Pabon†4 1 Add to Reading List Source URL: www.zaik.uni-koeln.de Language: English - Date: 2014-02-09 09:55:11 Graph theory Graph coloring Matching NP-complete problems Combinatorial optimization Graph operations Blossom algorithm Bipartite graph Chordal graph Complete coloring Cograph Ear decomposition
192	The scaling limit of the minimum spanning tree of the complete graph L. Addario-Berry∗, N. Broutin†, C. Goldschmidt‡, G. Miermont§ January 8, 2013 Abstract Consider the minimum spanning tree (MST) of the complete Add to Reading List Source URL: who.rocq.inria.fr Language: English - Date: 2014-07-14 05:27:02
193	Chapter 11 Traveling Salesman Here we study the classical Traveling Salesman problem: Given a complete graph G = (V, E) on n vertices with non-negative edge cost c : E → R+ find a tour T , P i.e., a cycle Add to Reading List Source URL: www2.informatik.hu-berlin.de Language: English - Date: 2014-06-25 03:14:23
194	Fixed-Parameter Tractability of Token Jumping on Planar Graphs arXiv:1406.6567v2 [cs.DM] 11 MarTakehiro Ito1 , Marcin Kami´ Add to Reading List Source URL: arxiv.org Language: English - Date: 2015-03-11 21:08:35 Graph theory NP-complete problems Planar graphs Independent set Graph Matching Ear decomposition Clique Bipartite graph Line graph Chordal graph
195	SEAProgram Monday, June 29th 8:00 8:50 9:00 Add to Reading List Source URL: sea2015.lip6.fr Language: English - Date: 2015-06-14 11:10:18 NP-complete problems Computational complexity theory Steiner tree problem Combinatorial optimization Shortest path problem Mathematical optimization Independent set Combinatorics Graph theory Book:Graph Theory
196	Recognizing k-equistable graphs in FPT time? Eun Jung Kim1 , Martin Milaniˇc2 , and Oliver Schaudt3 1 3 Add to Reading List Source URL: www.zaik.uni-koeln.de Language: English - Date: 2015-02-26 04:11:59 Graph theory Graph operations NP-complete problems Graph coloring Cograph Clique Matching Pathwidth
197	Approximating Fault-Tolerant Domination in General Graphs Klaus-Tycho Foerster∗ Abstract In this paper we study the NP-complete problem of finding small k-dominating sets in general graphs, which allow k − 1 nodes to Add to Reading List Source URL: www.tik.ee.ethz.ch Language: English - Date: 2015-05-18 12:16:23 Graph theory Mathematics Computational complexity theory NP-complete problems Dominating set Independent set Vertex cover Connected dominating set Set cover problem Line graph Metric k-center Domatic number
198	December 15, :20 WSPC - Proceedings Trim Size: 9.75in x 6.5in Add to Reading List Source URL: www.jsbi.org Language: English - Date: 2008-12-14 21:22:09 Graph theory Mathematics Computational complexity theory NP-complete problems Clique Subgraph isomorphism problem Matching Protein kinase Protein Root-mean-square deviation of atomic positions
199	EUROGRAPHICS ’M. Gross and F.R.A. Hopgood (Guest Editors) Volume 19, (2000), Number 3 Context-based Space Filling Curves Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2005-07-23 15:49:26 Mathematics Graph theory Computational complexity theory Fractal curves Television technology NP-complete problems Spanning tree Computer graphics Hilbert curve Space-filling curve Curve Peano curve
200	Magnús Már Halldórsson ICE-TCS, School of Computer Science Reykjavik University 101 Reykjavik, Iceland Add to Reading List Source URL: www.ru.is Language: English - Date: 2016-01-22 09:24:33 Computational complexity theory NP-complete problems Combinatorial optimization Theoretical computer science Maximum cut Approximation algorithm International Colloquium on Automata Languages and Programming Algorithmica Halldrsson International Symposium on Algorithms and Computation European Symposium on Algorithms Graph coloring

UPDATE